منابع مشابه
Colored Noise Inversion in Digital Half toning
A new digital halftone resolution technique, based on a neural network with connection strengths derived from stochastic power spectra, is proposed. Ulichney's "blue noise" spectrum is used as a basis; alternative spectra are also examined. The new technique is compared with standard resolution techniques, ordered dither, Floyd-Steinberg, and dot diffusion. The new technique appears to offer re...
متن کاملLasing without inversion: Gain enhancement through spectrally colored population pumping.
We propose the use of spectrally colored rather than white (i.e., incoherent) population pumping in lasing-without-inversion schemes. We show that colored pumping can lead to a significant enhancement in gain by presenting explicit results for the gain in a three-level ladder system. These results are obtained from Monte Carlo simulations of the coupled density-matrix-equations, which, for a co...
متن کاملColored Petri Net inversion for Backward Reachability Analysis
Colored Petri Nets (CPN) are a powerful, recognized and intuitive modelling tool. They allow a precise representation of distributed, embedded and/or real time systems. These models can be then used among others for the dependability assessment. This paper develops a new method of CPN analysis called the Backward reachability. It provides information about different ways of reaching a particula...
متن کاملColored Trees in Edge-Colored Graphs
The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Leading Edge
سال: 2017
ISSN: 1070-485X,1938-3789
DOI: 10.1190/tle36100858.1